An extension of path analysis revisited
نویسندگان
چکیده
منابع مشابه
an infinite planar array of rectangular microstrip patch antenna analysis
the methods which are used to analyze microstrip antennas, are divited into three categories: empirical methods, semi-empirical methods and full-wave analysis. empirical and semi-empirical methods are generally based on some fundamental simplifying assumptions about quality of surface current distribution and substrate thickness. thses simplificatioms cause low accuracy in field evaluation. ful...
15 صفحه اولAn Extension to Imprecise Data Envelopment Analysis
The standard data envelopment analysis (DEA) method assumes that the values for inputs and outputs are exact. While DEA assumes exact data, the existing imprecise DEA (IDEA) assumes that the values for some inputs and outputs are only known to lie within bounded intervals, and other data are known only up to an order. In many real applications of DEA, there are cases in which some of the input ...
متن کاملIs one path enough? Multiple paths and path interaction as an extension of path dependency theory
In order to explain the development of multi-technology companies and industries where several alternative technologies co-exist and interact over long time periods, this paper suggests an extension of path dependency theory by providing a conceptualization of the path notion which incorporates the theoretical possibility of multiple paths and path interaction. The conceptualization is applied ...
متن کاملRestricted Path Consistency Revisited
Restricted path consistency (RPC) is a strong local consistency for binary constraints that was proposed 20 years ago and was identified as a promising alternative to arc consistency (AC) in an early experimental study of local consistencies for binary constraints. However, and in contrast to other strong local consistencies such as SAC and maxRPC, it has been neglected since then. In this pape...
متن کاملPath consistency revisited
One of the main factors limiting the use of path consistency algorithms in real life applications is their high space complexity. Han and Lee 5] presented a path consistency algorithm, PC-4, with O(n 3 a 3) space complexity, which makes it practicable only for small problems. I present a new path consistency algorithm , PC-5, which has an O(n 3 a 2) space complexity while retaining the worst-ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Genetical Research
سال: 1984
ISSN: 0016-6723,1469-5073
DOI: 10.1017/s0016672300026264